class Solution {
    public int minArray(int[] numbers) {
        int l = 0;
        int r = numbers.length - 1;
        while (l < r) {
            int mid = l + (r - l) / 2;
            if (numbers[r] > numbers[mid]) r = mid;
            else if (numbers[l] < numbers[mid]) l = mid + 1;
            else r--;
        }
        return numbers[l];
    }
}
